- Title
- A finite-length algorithm for LDPC codes without repeated edges on the binary erasure channel
- Creator
- Johnson, Sarah J.
- Relation
- IEEE Transactions on Information Theory Vol. 55, Issue 1, p. 27-32
- Publisher Link
- http://dx.doi.org/10.1109/TIT.2008.2008118
- Publisher
- Institute of Electrical and Electronics Engineers (IEEE)
- Resource Type
- journal article
- Date
- 2009
- Description
- This paper considers the performance, on the binary erasure channel, of low-density parity-check (LDPC) codes without repeated edges in their Tanner graphs. A modification to existing finite-length analysis algorithms is presented for these codes.
- Subject
- binary erasure channels; finite-length analysis; iterative decoding; low-density parity-check (LDPC) codes; message-passing decoding
- Identifier
- http://hdl.handle.net/1959.13/809180
- Identifier
- uon:7843
- Identifier
- ISSN:0018-9448
- Language
- eng
- Reviewed
- Hits: 1178
- Visitors: 1134
- Downloads: 2
Thumbnail | File | Description | Size | Format |
---|